home *** CD-ROM | disk | FTP | other *** search
- Path: oreig.uji.es!ii202
- From: ii202@rossegat.uji.es (Jorge Acereda Macia)
- Newsgroups: comp.sys.amiga.programmer
- Subject: Re: Bitfieldinsert?
- Date: 5 Feb 1996 11:47:14 GMT
- Organization: Universitat Jaume I. Castell≤ de la Plana. Spain
- Message-ID: <4f4qo2$i6o@oreig.uji.es>
- References: <186.6602T1126T84@mbox2.swipnet.se> <38232222@kone.fipnet.fi>
- NNTP-Posting-Host: @rossegat.uji.es
- X-Newsreader: TIN [version 1.2 PL2]
-
- Jyrki Saarinen (jsaarinen@kone.fipnet.fi) wrote:
-
- > > Does anybody have timinginfo on the bitfieldinsertinstructions,
- > > i vas thinking about using them in a gouraudshading loop and
- > > maybe for tmapping.
-
- > They are quite slow. Better use a chunky buffer and
- > modern (very fast) chunky2planar routines if FAST-ram
-
- What's modern c2p? comparebuffers?
-
- I heard some time ago that gouraud can be made even more efficiently
- in planar than in chunky... Anyone knows something about this?
-
- Greets,
- --
- ---------------------------- --------------------------------------------
- | Jorge Acereda | Dream the same thing everynight |
- | ii202@rossegat.uji.es | I see our freedom in my sight |
- | Intel Outside | No locked doors, no windows barred |
- | Amiga Rules | No things to make my brain seem scarred |
- ---------------------------- --------------------------------------------
-